Research on a Heuristic Searching Algorithm for Energy-aware Routing in Wireless Sensor Networks
نویسندگان
چکیده
Because cluster-head nodes in wireless sensor networks may be far away from the base station, or there exists many obstacles in deployment environments of wireless sensor networks to affect the data transmission performance, they would consume excessive energy in the process of the massive data transmission, which may lead to their earlier death. To solve this problem, a LEACH-A* algorithm is presented in this paper, which utilizes the distance among cluster-head nodes and their corresponding energy and combines with the heuristic searching algorithm to provide the multi-hop communication mode. It can avoid earlier death of some cluster-head nodes, and shift the energy consumption burden from cluster-head nodes to the whole sensor network, thus to prolong the life cycle of the network and improve the transmission quality.
منابع مشابه
A JOINT DUTY CYCLE SCHEDULING AND ENERGY AWARE ROUTING APPROACH BASED ON EVOLUTIONARY GAME FOR WIRELESS SENSOR NETWORKS
Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...
متن کاملمسیریابی انرژی آگاه در شبکه های حسگر بی سیم با استفاده از الگوریتم جستجوی هارمونی
At the present, energy aware routing is one of the most important research topics in wireless sensor networks. Increasing network lifetime is the most challenging need in these networks. In this study, in order to increase network lifetime, we aim to introduce a harmony search algorithm as a successful meta-heuristic algorithm for routing in the wireless sensor networks. In customizing the algo...
متن کاملImproving Energy Consumption by Using Cluster Based Routing Algorithm in Wireless Sensor Networks
Multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. In this paper, a new clustering based multi path routingprotocol namely ECRR (Energy efficient Cluster based Routing algorithm for improving Reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required QoS ...
متن کاملCombining Harmony search algorithm and Ant Colony Optimization algorithm to increase the lifetime of Wireless Sensor Networks
Wireless Sensor Networks are the new generation of networks that typically are formed great numbers of nodes and the communications of these nodes are done as Wireless. The main goal of these networks is collecting data from neighboring environment of network sensors. Since the sensor nodes are battery operated and there is no possibility of charging or replacing the batteries, the lifetime of ...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملMLCA: A Multi-Level Clustering Algorithm for Routing in Wireless Sensor Networks
Energy constraint is the biggest challenge in wireless sensor networks because the power supply of each sensor node is a battery that is not rechargeable or replaceable due to the applications of these networks. One of the successful methods for saving energy in these networks is clustering. It has caused that cluster-based routing algorithms are successful routing algorithm for these networks....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013